Two-pass search strategy for large list recognition on embedded speech recognition platforms
نویسندگان
چکیده
This paper presents an efficient algorithm for a speech recognition system which can process large lists of items. The described two-pass search implementation focuses on maximizing the speed and minimizing the memory footprint of the search engine. The algorithm is designed to handle thousands or tens of thousands of words in a search space restricted by a grammar. A typical example of such a task is stock name recognition, street name finding, song selection etc. The intended application of this algorithm is in embedded ASR system in portable devices (e.g. iPAQ) or cars.
منابع مشابه
Novel two-pass search strategy using time-asynchronous shortest-first second-pass beam search
In this paper, we describe a novel two-pass search strategy for large vocabulary continuous speech recognition. The first-pass of this strategy uses a regular time-synchronous beam search with rough models to generate a word lattice. Then, the second-pass search derives exact results from the word lattice using more accurate models. This search is “time-asynchronous shortest-first beam search”,...
متن کاملSpoken Term Detection for Persian News of Islamic Republic of Iran Broadcasting
Islamic Republic of Iran Broadcasting (IRIB) as one of the biggest broadcasting organizations, produces thousands of hours of media content daily. Accordingly, the IRIBchr('39')s archive is one of the richest archives in Iran containing a huge amount of multimedia data. Monitoring this massive volume of data, and brows and retrieval of this archive is one of the key issues for this broadcasting...
متن کاملA word graph algorithm for large vocabulary, continuous speech recognition
This paper describes a method for the construction of a word graph (or lattice) for large vocabulary, continuous speech recognition. The advantage of a word graph is that a fairly good degree of decoupling between acoustic recognition at the 10-ms level and the final search at the word level using a complicated language model can be achieved. The word graph algorithm is obtained as an extension...
متن کاملImproved search strategy for large vocabulary continuous Mandarin speech recognition
This paper presents a new search strategy for large vocabulary continuous Mandarin speech recognition considering the special structure of Chinese language. This strategy is composed of a forward and a backward passes, between which a high-quality syllable lattice is generated to bridge the syllable-level and word-level decoding processes. In the forward pass, considering the small number of sy...
متن کاملConfidence measure driven scalable two-pass grammars
In this article we will discuss recognition performance on large list grammars, a class of tasks often encountered in telephony applications. In these tasks, the user makes a selection from a large list of choices (e.g. stock quotes, yellow pages, etc). Though the redundancy of the complete utterance is often high enough to achieve high recognition accuracy, large search space presents a challe...
متن کامل